On the Density of Normal Bases in Finite Fields
نویسنده
چکیده
Let Fqn denote the finite field with q elements, for q being a prime power. Fqn may be regarded as an n-dimensional vector space over Fq. α ∈ Fqn generates a normal basis for this vector space (Fqn : Fq), if {α,α , αq2 , . . . , αq} are linearly independent over Fq. Let N(q, n) denote the number of elements in Fqn that generate a normal basis for Fqn : Fq, and let ν(q, n) = N(q,n) qn denote the frequency of such elements. We show that there exists a constant c > 0 such that ν(q, n) ≥ c 1 √ dlogq ne , for all n, q ≥ 2 and this is optimal up to a constant factor in that we show 0.28477 ≤ lim n→∞ inf ν(q, n) √ logq n ≤ 0.62521, for all q ≥ 2 We also obtain an explicit lower bound: ν(q, n) ≥ 1 edlogq ne , for all n, q ≥ 2 ∗Supported by the ESPRIT Long Term Research Programme of the EU, under project number 20244 (ALCOM-IT) †Basic Research in Computer Science, Centre of the Danish National Research Foundation.
منابع مشابه
Finite field arithmetic using quasi-normal bases
Efficient multiplication in finite fields Fqn requires Fq-bases of low density,i.e., such that the products of the basis elements have a sparse expression in the basis. In this paper we introduce a new family of bases: the quasi-normal bases. These bases generalize the notion of normal bases and provide simple exponentiation to the power q in Fqn . For some extension fields Fqn over Fq, we cons...
متن کاملElliptic periods for finite fields
We construct two new families of basis for finite field extensions. Bases in the first family, the so-called elliptic bases, are not quite normal bases, but they allow very fast Frobenius exponentiation while preserving sparse multiplication formulas. Bases in the second family, the so-called normal elliptic bases are normal bases and allow fast (quasi-linear) arithmetic. We prove that all exte...
متن کاملAbelian Groups, Gauss Periods, and Normal Bases
A result on finite abelian groups is first proved and then used to solve problems in finite fields. Particularly, all finite fields that have normal bases generated by general Gauss periods are characterized and it is shown how to find normal bases of low complexity. Dedicated to Professor Chao Ko on his 90th birthday.
متن کاملA new criterion on normal bases of finite field extensions
A new criterion on normal bases of finite field extension Fqn/Fq is presented and explicit criterions for several particular finite field extensions are derived from this new criterion.
متن کاملThe effect of increasing the multiplicity of flow fields contact surface on the performance of PEM fuel cell
In this paper, three innovative 3-D geometries for flow fields of cathode and anode have been developed to investigate the comparative impact of increasing the multiplicity of the involved anode-cathode channel surface contact on the efficiency of electrochemical reaction via the same membrane electrode assembly (MEA) active area. In the introduced new models, each anode channel includes two, t...
متن کاملConstruction of self-dual normal bases and their complexity
Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer search, to identify the lowest complexity of selfdual normal bases for extensions of low degree. Comparisons to similar searches amongst normal bases show t...
متن کامل